Pseudo-Boolean optimisation for RobinX sports timetabling
نویسندگان
چکیده
Abstract We report on the development of Reprobate, a tool for solving sports timetabling problems in subset RobinX format. Our is based around monolithic translation instance into pseudo-Boolean (PB) optimisation problem; this can be solved using existing solvers. Once has found feasible solution, it improve second encoding that alters only home/away pattern games. entered our International Timetabling Competition 2021. While was effective many instances, struggled to cope with schedules involving large break constraints. However, among instances which could initially find combination use portfolio solvers, range variations and aforementioned local improvement process yielded an average reduction solution cost 23%.
منابع مشابه
Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation
Selection hyper-heuristics are randomised search methodologies which choose and execute heuristics from a set of low-level heuristics. Recent research for the LeadingOnes benchmark function has shown that the standard Simple Random, Permutation, Random Gradient, Greedy and Reinforcement Learning selection mechanisms show no effects of learning. The idea behind the learning mechanisms is to cont...
متن کاملPseudo-Boolean optimization
This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced)...
متن کاملLocally monotone Boolean and pseudo-Boolean functions
We propose local versions of monotonicity for Boolean and pseudoBoolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p positions. As it turns out, this parameterized notion provides a hierarchy of monotonicities for pseudo-Boolean (Boolean) functions. Local monotonicities are ...
متن کاملLocal-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-search methods to compute models of PL(PB)theories. In our approach we view a PL(PB)-theory T as a data structure — a concise representation of a certain propositional CNF theory cl(T ) logically equivalent to T . We sh...
متن کاملPseudo-Boolean valued prolog
Logic programming has generally been developed in a Classical two-valued setting; there are no “degrees of truth”. What we propose here is the introduction of more general spaces of truth values, reading truth values as “evidence factors”. Then conventional logic programming may be seen as the special case in which only total evidence is acceptable, and so the space of evidences degenerates to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2022
ISSN: ['1099-1425', '1094-6136']
DOI: https://doi.org/10.1007/s10951-022-00737-7